583. Delete Operation for Two Strings - LeetCode Solution


String

Python Code:

class Solution:
    def minDistance(self, a: str, b: str) -> int:
        		
        t = []
        
        for i in range(len(a) + 1):
        
            l = []
            for j in range(len(b) + 1):
                l.append(0)
            t.append(l)
        
        
        
        for i in range(1, len(a) +1, 1):
            for j in range(1, len(b) + 1, 1):
                if a[i-1] == b[j-1]:
                    t[i][j] = 1 + t[i-1][j-1]
                else:
                    t[i][j] = max(t[i][j-1], t[i-1][j])
        
        
        return len(a) + len(b) -  (t[len(a)][len(b)] * 2)
        


Comments

Submit
0 Comments
More Questions

49A - Sleuth
1541A - Pretty Permutations
1632C - Strange Test
673A - Bear and Game
276A - Lunch Rush
1205A - Almost Equal
1020B - Badge
1353A - Most Unstable Array
770A - New Password
1646B - Quality vs Quantity
80A - Panoramix's Prediction
1354B - Ternary String
122B - Lucky Substring
266B - Queue at the School
1490A - Dense Array
1650B - DIV + MOD
1549B - Gregor and the Pawn Game
553A - Kyoya and Colored Balls
1364A - XXXXX
1499B - Binary Removals
1569C - Jury Meeting
108A - Palindromic Times
46A - Ball Game
114A - Cifera
776A - A Serial Killer
25B - Phone numbers
1633C - Kill the Monster
1611A - Make Even
1030B - Vasya and Cornfield
1631A - Min Max Swap